Every toroidal graph without triangles adjacent to $5$-cycles is DP-$4$-colorable
نویسنده
چکیده
DP-coloring, also known as correspondence coloring, is introduced by Dvořák and Postle. It is a generalization of list coloring. In this paper, we show that every connected toroidal graph without triangles adjacent to 5-cycles has minimum degree at most three unless it is a 2-connected 4-regular graph with Euler characteristic (G) = 0. Consequently, every toroidal graph without triangles adjacent to 5-cycles is DP-4-colorable. In the final, we show that every planar graph without two certain subgraphs is DP-4-colorable. As immediate consequences, (i) every planar graph without 3-cycles adjacent to 4-cycles is DP-4-colorable; (ii) every planar graph without 3-cycles adjacent to 5-cycles is DP-4-colorable; (iii) every planar graph without 4-cycles adjacent to 5-cycles is DP-4-colorable.
منابع مشابه
On list vertex 2-arboricity of toroidal graphs without cycles of specific length
The vertex arboricity $rho(G)$ of a graph $G$ is the minimum number of subsets into which the vertex set $V(G)$ can be partitioned so that each subset induces an acyclic graph. A graph $G$ is called list vertex $k$-arborable if for any set $L(v)$ of cardinality at least $k$ at each vertex $v$ of $G$, one can choose a color for each $v$ from its list $L(v)$ so that the subgraph induced by ev...
متن کاملBordeaux 3-color conjecture and 3-choosability
A graph G = (V ,E) is list L-colorable if for a given list assignment L = {L(v) : v ∈ V }, there exists a proper coloring c of G such that c(v) ∈ L(v) for all v ∈ V . If G is list L-colorable for every list assignment with |L(v)| k for all v ∈ V , then G is said to be k-choosable. In this paper, we prove that (1) every planar graph either without 4and 5-cycles, and without triangles at distance...
متن کاملA relaxation of the Bordeaux Conjecture
A (c1, c2, ..., ck)-coloring of G is a mapping φ : V (G) 7→ {1, 2, ..., k} such that for every i, 1 ≤ i ≤ k, G[Vi] has maximum degree at most ci, where G[Vi] denotes the subgraph induced by the vertices colored i. Borodin and Raspaud conjecture that every planar graph without intersecting triangles and 5-cycles is 3-colorable. We prove in this paper that every planar graph without intersecting ...
متن کاملEvery toroidal graph without adjacent triangles is (4, 1)*-choosable
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph without adjacent triangles is (4, 1)∗-choosable. This result is best possible in the sense that K7 is a non-(3, 1)∗-choosable toroidal graph. A linear time algorithm for producing such a coloring is presented also. © 20...
متن کامل2 01 0 Every planar graph without adjacent short cycles is 3 - colorable
Two cycles are adjacent if they have an edge in common. Suppose that G is a planar graph, for any two adjacent cycles C1 and C2, we have |C1| + |C2| ≥ 11, in particular, when |C1| = 5, |C2| ≥ 7. We show that the graph G is 3-colorable.
متن کامل